Axiom of Choice - definizione. Che cos'è Axiom of Choice
Diclib.com
Dizionario ChatGPT
Inserisci una parola o una frase in qualsiasi lingua 👆
Lingua:

Traduzione e analisi delle parole tramite l'intelligenza artificiale ChatGPT

In questa pagina puoi ottenere un'analisi dettagliata di una parola o frase, prodotta utilizzando la migliore tecnologia di intelligenza artificiale fino ad oggi:

  • come viene usata la parola
  • frequenza di utilizzo
  • è usato più spesso nel discorso orale o scritto
  • opzioni di traduzione delle parole
  • esempi di utilizzo (varie frasi con traduzione)
  • etimologia

Cosa (chi) è Axiom of Choice - definizione


Axiom of choice         
  • (S<sub>''i''</sub>) is an infinite [[indexed family]] of sets indexed over the [[real number]]s '''R'''; that is, there is a set S<sub>''i''</sub> for each real number ''i'', with a small sample shown above. Each set contains at least one, and possibly infinitely many, elements. The axiom of choice allows us to arbitrarily select a single element from each set, forming a corresponding family of elements (''x''<sub>''i''</sub>) also indexed over the real numbers, with ''x''<sub>''i''</sub> drawn from S<sub>''i''</sub>. In general, the collections may be indexed over any set <span style="font-family:serif;">''I''</span>, (called index set which elements are used as indices for elements in a set) not just '''R'''.
STATEMENT THAT THE PRODUCT OF A COLLECTION OF NON-EMPTY SETS IS NON-EMPTY
AxiomOfChoice; Axiom of Choice; Choice axiom; Choice Axiom; Axiom Of Choice; ZF¬C; Equivalents of the axiom of choice; Independence of the axiom of choice; The Axiom of Choice; Partition principle
In mathematics, the axiom of choice, or AC, is an axiom of set theory equivalent to the statement that a Cartesian product of a collection of non-empty sets is non-empty. Informally put, the axiom of choice says that given any collection of bins, each containing at least one object, it is possible to construct a set by arbitrarily choosing one object from each bin, even if the collection is infinite.
Axiom of Choice         
  • (S<sub>''i''</sub>) is an infinite [[indexed family]] of sets indexed over the [[real number]]s '''R'''; that is, there is a set S<sub>''i''</sub> for each real number ''i'', with a small sample shown above. Each set contains at least one, and possibly infinitely many, elements. The axiom of choice allows us to arbitrarily select a single element from each set, forming a corresponding family of elements (''x''<sub>''i''</sub>) also indexed over the real numbers, with ''x''<sub>''i''</sub> drawn from S<sub>''i''</sub>. In general, the collections may be indexed over any set <span style="font-family:serif;">''I''</span>, (called index set which elements are used as indices for elements in a set) not just '''R'''.
STATEMENT THAT THE PRODUCT OF A COLLECTION OF NON-EMPTY SETS IS NON-EMPTY
AxiomOfChoice; Axiom of Choice; Choice axiom; Choice Axiom; Axiom Of Choice; ZF¬C; Equivalents of the axiom of choice; Independence of the axiom of choice; The Axiom of Choice; Partition principle
<mathematics> (AC, or "Choice") An axiom of set theory: If X is a set of sets, and S is the union of all the elements of X, then there exists a function f:X -> S such that for all non-empty x in X, f(x) is an element of x. In other words, we can always choose an element from each set in a set of sets, simultaneously. Function f is a "choice function" for X - for each x in X, it chooses an element of x. Most people's reaction to AC is: "But of course that's true! From each set, just take the element that's biggest, stupidest, closest to the North Pole, or whatever". Indeed, for any finite set of sets, we can simply consider each set in turn and pick an arbitrary element in some such way. We can also construct a choice function for most simple {infinite sets} of sets if they are generated in some regular way. However, there are some infinite sets for which the construction or specification of such a choice function would never end because we would have to consider an infinite number of separate cases. For example, if we express the real number line R as the union of many "copies" of the rational numbers, Q, namely Q, Q+a, Q+b, and infinitely (in fact uncountably) many more, where a, b, etc. are irrational numbers no two of which differ by a rational, and Q+a == q+a : q in Q we cannot pick an element of each of these "copies" without AC. An example of the use of AC is the theorem which states that the countable union of countable sets is countable. I.e. if X is countable and every element of X is countable (including the possibility that they're finite), then the sumset of X is countable. AC is required for this to be true in general. Even if one accepts the axiom, it doesn't tell you how to construct a choice function, only that one exists. Most mathematicians are quite happy to use AC if they need it, but those who are careful will, at least, draw attention to the fact that they have used it. There is something a little odd about Choice, and it has some alarming consequences, so results which actually "need" it are somehow a bit suspicious, e.g. the Banach-Tarski paradox. On the other side, consider Russell's Attic. AC is not a theorem of Zermelo Frankel set theory (ZF). Godel and Paul Cohen proved that AC is independent of ZF, i.e. if ZF is consistent, then so are ZFC (ZF with AC) and ZF(Axiom of ChoiceC) (ZF with the negation of AC). This means that we cannot use ZF to prove or disprove AC. (2003-07-11)
Equivalents of the Axiom of Choice         
  • (S<sub>''i''</sub>) is an infinite [[indexed family]] of sets indexed over the [[real number]]s '''R'''; that is, there is a set S<sub>''i''</sub> for each real number ''i'', with a small sample shown above. Each set contains at least one, and possibly infinitely many, elements. The axiom of choice allows us to arbitrarily select a single element from each set, forming a corresponding family of elements (''x''<sub>''i''</sub>) also indexed over the real numbers, with ''x''<sub>''i''</sub> drawn from S<sub>''i''</sub>. In general, the collections may be indexed over any set <span style="font-family:serif;">''I''</span>, (called index set which elements are used as indices for elements in a set) not just '''R'''.
MATHEMATICS BOOK
AxiomOfChoice; Axiom of Choice; Choice axiom; Choice Axiom; Axiom Of Choice; ZF¬C; Equivalents of the axiom of choice; Independence of the axiom of choice; The Axiom of Choice; Partition principle
Equivalents of the Axiom of Choice is a book in mathematics, collecting statements in mathematics that are true if and only if the axiom of choice holds. It was written by Herman Rubin and Jean E.